Blue Swarm 2.5: A Step Toward an Autonomous Swarm of Search and Rescue Robots
نویسندگان
چکیده
Urban search and rescue is a difficult domain for autonomous mobile robots to operate in. The environment can be expected to be highly unstructured, with many obstacles and hazards for a robot to deal with. In addition, if human rescue teams are going to accept robotic assistance, they need to be assured that the robots are going to be helpful, not a hindrance. With these factors in mind, we have been working toward the development of an autonomous swarm of small, inexpensive search and rescue robots. The robots should be autonomous in order to provide useful information to human rescuers without requiring specialized knowledge in operating robots. A swarm is useful because it allows for losses of individual robots and for redundant communications pathways, without losing overall effectiveness of the swarm. The robots should be small so they will not pose a danger to rescuers or the victims being searched for. And they should be inexpensive because worrying about the loss of robots should not be a consideration for human rescuers. Blue Swarm 2.5 is the latest incarnation in our quest for an autonomous rescue robot swarm. This paper describes our efforts to develop an effective rescue robot swarm. The paper starts by describing the past incarnations of the swarm, including the research objectives being pursued and the results obtained. Then the most recent version of the swarm, Blue Swarm 2.5, is described. Finally, the plans for Blue Swarm 3, the first fully functional rescue swarm, will be described.
منابع مشابه
Blue Swarm 3: Integrating Capabilities for an Autonomous Rescue Robot Swarm
The robotics team at Utah State University has been working on incrementally building the capabilities needed to field an autonomous swarm of rescue robots. We believe a swarm of small, low-cost robots that can identify areas needing further investigation would be of great benefit to first responders to the scene of a disaster. Blue Swarm 3 is the latest iteration in this development process an...
متن کاملHuman Detection by Tartan Swarm
Tartan Swarm was an autonomous, multi-robot entry in the 2002 Mobile Robot Urban Search and Rescue Competition. The robots were designed to be low-cost, adaptable, and disposable. Emphasis was given to human detection techniques, The design did not feature localization or mapping capability. In the competition, the robots may have detected bodies, but were unable to report location or success.
متن کاملDesigning an Optimal Stable Algorithm for Robot Swarm Motion toward a Target
In this paper, an optimal stable algorithm is presented for members of a robots swarm moving toward a target. Equations of motion of the swarm are based on Lagrangian energy equations. Regarding of similar research On the design of swarm motion algorithm, an equation of motion considered constraints to guarantee no collision between the members and the members and obstacles along the motion pat...
متن کاملEnhancing cooperative transport using negotiation of goal direction
Swarm robotics is a relatively new approach to the coordination of a system composed of a large number of autonomous robots. The coordination among the robots is achieved in a self-organised manner: the collective behaviour of the robots is the result of local interactions among robots, and between the robots and the environment. Each single robot typically has limited sensing, acting and compu...
متن کاملCooperative hole avoidance in a swarm-bot
In this paper, we study coordinated motion in a swarm robotic system, called a swarm-bot. A swarm-bot is a self-assembling and self-organising artifact, composed of a swarm of s-bots, mobile robots with the ability to connect to and disconnect from each other. The swarm-bot concept is particularly suited for tasks that require all-terrain navigation abilities, such as space exploration or rescu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003